منابع مشابه
Admissible Orders of Jordan Loops
A commutative loop is Jordan if it satisfies the identity x2(yx) = (x2y)x. Using an amalgam construction and its generalizations, we prove that a nonassociative Jordan loop of order n exists if and only if n ≥ 6 and n 6= 9. We also consider whether powers of elements in Jordan loops are well-defined, and we construct an infinite family of finite simple nonassociative Jordan loops.
متن کاملConstruction of admissible linear orders for pairs of intervals
In this work we construct linear orders between pairs of intervals by using aggregation functions. We apply these orders in a decision-making problem where the experts provide their opinions by means of interval-valued fuzzy sets.
متن کاملPossible orders of nonassociative Moufang loops
The paper surveys the known results concerning the question: “For what values of n does there exist a nonassociative Moufang loop of order n?” Proofs of the newest results for n odd, and a complete resolution of the case n even are also presented.
متن کاملOn the classes of Steiner loops of small orders
According to the number of sub-SL(8)s (sub-STS(7)s), there are five classes of sloops SL(16)s (STS(15)s) [2, 5].) In [4] the author has classified SL(20)s into 11 classes. Using computer technique in [10] the authors gave a large number for each class of SL(20)s. There are only simple SL(22)s and simple SL(26)s. So the next admissible cardinality is 28. Also, all SL(32)s are classified into 14 ...
متن کاملOn finite loops whose inner mapping groups have small orders
We investigate the situation that the inner mapping group of a loop is of order which is a product of two small prime numbers and we show that then the loop is soluble.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Designs
سال: 2009
ISSN: 1063-8539,1520-6610
DOI: 10.1002/jcd.20186